منابع مشابه
Random Intersection Graph Process
Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...
متن کاملConnectivity of the uniform random intersection graph
A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...
متن کاملVertex Degree of Random Intersection Graph
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we dete...
متن کاملThe random planar graph process
We consider the following variant of the classical random graph process introduced by Erdős and Rényi. Starting with an empty graph on n vertices, choose the next edge uniformly at random among all edges not yet considered, but only insert it if the graph remains planar. We show that for all ε > 0, with high probability, θ(n) edges have to be tested before the number of edges in the graph reach...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2014
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2014.982310